Outfix-guided insertion
نویسندگان
چکیده
منابع مشابه
Outfix-guided insertion
Motivated by work on bio-operations on DNA strings, we consider an outfixguided insertion operation that can be viewed as a generalization of the overlap assembly operation on strings studied previously. As the main result we construct a finite language L such that the outfix-guided insertion closure of L is non-regular. We consider also the closure properties of regular and (deterministic) con...
متن کاملOutfix-Free Regular Languages and Prime Outfix-Free Decomposition
A string x is an outfix of a string y if there is a string w such that x1wx2 = y and x = x1x2. A set X of strings is outfix-free if no string in X is an outfix of any other string in X . Based on the properties of outfix strings, we develop a polynomial-time algorithm that determines outfix-freeness of regular languages. Note that outfix-free regular languages are always finite. We consider two...
متن کاملSpontaneous Transmembrane Helix Insertion Thermodynamically Mimics Translocon-guided Insertion
The favourable transfer free energy for a transmembrane (TM) α-helix between the aqueous phase and lipid bilayer underlies the stability of membrane proteins. However, the connection between the energetics and process of membrane protein assembly by the Sec61/SecY translocon complex in vivo is not clear. Here, we directly determine the partitioning free energies of a family of designed peptides...
متن کاملGuided pedicle screw insertion: techniques and training.
BACKGROUND CONTEXT In spinal fusion surgery, the accuracy with which screws are inserted in the pedicle has a direct effect on the surgical outcome. Accurate placement generally involves considerable judgmental skills that have been developed through a lengthy training process. Because the impact of misaligning one or more pedicle screws can directly affect patient safety, a number of navigatio...
متن کاملCounter-Example Guided Fence Insertion under TSO
We give a sound and complete fence insertion procedure for concurrent finite-state programs running under the classical TSO memory model. This model allows “write to read” relaxation corresponding to the addition of an unbounded store buffer between each processor and the main memory. We introduce a novel machine model, called the Single-Buffer (SB) semantics, and show that the reachability pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.03.040